Topological Intersection Theorems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intersection homology Künneth theorems

Cohen, Goresky and Ji showed that there is a Künneth theorem relating the intersection homology groups I H∗(X × Y ) to I H∗(X) and I H∗(Y ), provided that the perversity p̄ satisfies rather strict conditions. We consider biperversities and prove that there is a Künneth theorem relating I H∗(X × Y ) to I H∗(X) and I H∗(Y ) for all choices of p̄ and q̄. Furthermore, we prove that the Künneth theorem...

متن کامل

More complete intersection theorems

The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of a k-uniform t-intersecting family on n points, and describes all optimal families. In recent work, we extended this theorem to the weighted setting, giving the maximum μp measure of a t-intersecting family on n points. In this work, we prove two new complete intersection theorems. The first gi...

متن کامل

Exact k-Wise Intersection Theorems

A typical problem in extremal combinatorics is the following. Given a large number n and a set L, find the maximum cardinality of a family of subsets of a ground set of n elements such that the intersection of any two subsets has cardinality in L. We investigate the generalization of this problem, where intersections of more than 2 subsets are considered. In particular, we prove that when k − 1...

متن کامل

Intersection theorems in permutation groups

The Hamming distance between two permutations of a finite set X is the number of elements of X on which they differ. In the first part of this paper, we consider bounds for the cardinality of a subset (or subgroup) of a permutation group P on X with prescribed distances between its elements. In the second part. We consider similar results for sets of s-tuples of permutations; the role of Hammin...

متن کامل

Intersection theorems under dimension constraints

In [8] we posed a series of extremal (set system) problems under dimension constraints. In the present paper we study one of them: the intersection problem. The geometrical formulation of our problem is as follows. Given integers 0 ≤ t, k ≤ n determine or estimate the maximum number of (0, 1)–vectors in a k–dimensional subspace of the Euclidean n–space Rn, such that the inner product (“intersec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1993

ISSN: 0002-9939

DOI: 10.2307/2159527